Positive Definiteness via Off-Diagonal Scaling of a Symmetric Indefinite Matrix.

نویسندگان

  • Peter M Bentler
  • Ke-Hai Yuan
چکیده

Indefinite symmetric matrices that are estimates of positive definite population matrices occur in a variety of contexts such as correlation matrices computed from pairwise present missing data and multinormal based theory for discretized variables. This note describes a methodology for scaling selected off-diagonal rows and columns of such a matrix to achieve positive definiteness. As a contrast to recently developed ridge procedures, the proposed method does not need variables to contain measurement errors. When minimum trace factor analysis is used to implement the theory, only correlations that are associated with Heywood cases are shrunk.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Effective and Robust Preconditioning of General SPD Matrices via Structured Incomplete Factorization

For general symmetric positive definite (SPD) matrices, we present a framework for designing effective and robust black-box preconditioners via structured incomplete factorization. In a scaling-and-compression strategy, off-diagonal blocks are first scaled on both sides (by the inverses of the factors of the corresponding diagonal blocks) and then compressed into low-rank approximations. ULV-ty...

متن کامل

On solving sparse symmetric linear systems whose definiteness is unknown

Solving a large, sparse, symmetric linear system Ax = b iteratively must use appropriate methods. The conjugate gradient (CG) method can break down if A is indefinite while algorithms such as SYMMLQ and MINRES, though stable for indefinite systems, are computationally more expensive than CG when applied to positive definite matrices. In this paper, we present an iterative method for the case wh...

متن کامل

M-Tensors and Some Applications

We introduce M -tensors. This concept extends the concept ofM -matrices. We denote Z-tensors as the tensors with nonpositive off-diagonal entries. We show that M -tensors must be Ztensors and the maximal diagonal entry must be nonnegative. The diagonal elements of a symmetric M -tensor must be nonnegative. A symmetric M -tensor is copositive. Based on the spectral theory of nonnegative tensors,...

متن کامل

Matrix Exponential Gradient Updates for On-line Learning and Bregman Projection

We address the problem of learning a symmetric positive definite matrix. The central issue is to design parameter updates that preserve positive definiteness. Our updates are motivated with the von Neumann divergence. Rather than treating the most general case, we focus on two key applications that exemplify our methods: On-line learning with a simple square loss and finding a symmetric positiv...

متن کامل

Scaling symmetric positive definite matrices to prescribed row sums

We give a constructive proof of a theorem of Marshall and Olkin that any real symmetric positive definite matrix can be symmetrically scaled by a positive diagonal matrix to have arbitrary positive row sums. We give a slight extension of the result, showing that given a sign pattern, there is a unique diagonal scaling with that sign pattern, and we give upper and lower bounds on the entries of ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Psychometrika

دوره 76 1  شماره 

صفحات  -

تاریخ انتشار 2011